On a Reconstruction Problem of Harary and Manvel
نویسنده
چکیده
We give a complete answer to a question raised by Harary and Manvel in 1972 [3] by proving that a finite set A of points in the plane R is uniquely determined up to translation and rotation by a multiple of 90◦ by 5 of its (|A| − 1)-element subsets given up to translation and rotation by a multiple of 90◦. This result is best-possible.
منابع مشابه
A survey of some open questions in reconstruction numbers
Frank Harary contributed numerous questions to a variety of topics in graph theory. One of his favourite topics was the Reconstruction Problem which, in its first issue in 1977, the Journal of Graph Theory described as the major unsolved problem in the field. Together with Plantholt, Frank Harary initiated the study of reconstruction numbers of graphs. We shall here present a survey of some of ...
متن کاملToughness of the Networks with Maximum Connectivity
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملGraph reconstruction from subgraphs
The Reconstruction Conjecture asserts that every ÿnite simple undirected graph on 3 or more vertices is determined, up to isomorphism, by its collection of (unlabeled) one-vertex-deleted subgraphs. A more general problem can be investigated if the collection consists of all (unla-beled) subgraphs with a restricted number of vertices. Kelly (Paciÿc J. Math. 7 (1957) 961–968) ÿrst raised the poss...
متن کاملA Counterexample to the Reconstruction Conjecture for Locally Finite Trees
Two graphs G and H are hypomorphic if there exists a bijection φ : V (G)→ V (H) such that G− v ∼= H − φ(v) for each v ∈ V (G). A graph G is reconstructible if H ∼= G for all H hypomorphic to G. It is well known that not all infinite graphs are reconstructible. However, the Harary-Schwenk-Scott Conjecture from 1972 suggests that all locally finite trees are reconstructible. In this paper, we con...
متن کاملA Discourse on Three Combinatorial Diseases
Frank Harary in his article [2] was the first to speak of combinatorial diseases (actually, he spoke of graphical diseases). His original diseases were the four-colour disease, the hamiltonian disease and the reconstruction disease. Shortly thereafter, Read and Corneil [9] have discussed the graph isomorphism disease, and somewhat later, Huang, Kotzig and Rosa [4] spoke of a labelling disease. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 99 شماره
صفحات -
تاریخ انتشار 2002